# ---
# title: 567. Permutation in String
# id: problem567
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Two Pointers, Sliding Window
# link: <https://leetcode.com/problems/permutation-in-string/description/>
# hidden: true
# ---
# 
# Given two strings **s1** and **s2** , write a function to return true if
# **s2** contains the permutation of **s1**. In other words, one of the first
# string's permutations is the **substring** of the second string.
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: s1 = "ab" s2 = "eidbaooo"
#     Output: True
#     Explanation: s2 contains one permutation of s1 ("ba").
#     
# 
# **Example 2:**
# 
#     
#     
#     Input: s1= "ab" s2 = "eidboaoo"
#     Output: False
#     
# 
# 
# 
# **Constraints:**
# 
#   * The input strings only contain lower case letters.
#   * The length of both given strings is in range [1, 10,000].
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
